SHOP: Simple Hierarchical Ordered Planner

نویسندگان

  • Dana S. Nau
  • Yue Cao
  • Amnon Lotem
  • Hector Muñoz-Avila
چکیده

SHOP (Simple Hierarchical Ordered Planner) is a domain-independent H T N planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goalinteraction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planning process, it can use highly expressive domain representations. For example, it can do planning problems that require complex numeric computations. • In our tests, SHOP was several orders of magnitude faster man Blackbox and several times faster than TLpian, even though SHOP is coded in Lisp and the other planners are coded in C.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HOTRiDE: Hierarchical Ordered Task Replanning in Dynamic Environments

One of the assumptions in classical planning is that the environment is static: i.e., the planner is the only entity that can induce changes in the environment. A more realistic assumption is that the environment is dynamic; that is, there are other entities in the world and the actions generated by the planner may fail due to the operations of these entitites. In this paper, we describe a plan...

متن کامل

PC-SHOP: A Probabilistic-Conditional Hierarchical Task Planner

SOMMARIO/ABSTRACT In this paper we report on the extension of the classical HTN planner SHOP to plan in partially observable domains with uncertainty. Our algorithm PC-SHOP uses belief states to handle situations involving incomplete and uncertain information about the state of the world. Sensing and acting are integrated in the primitive actions through the use of a stochastic model. PC-SHOP i...

متن کامل

Hierarchical Task Planning under Uncertainty

In this paper we present an algorithm for planning in nondeterministic domains. Our algorithm C-SHOP extends the successful classical HTN planner SHOP, by introducing new mechanisms to handle situations where there is incomplete and uncertain information about the state of the environment. Being an HTN planner, C-SHOP supports coding domain-dependent knowledge in a powerful way that describes h...

متن کامل

Bidding for Composite Products using Plans for Matching the Substitute Items

To achieve a composite product an agent needs sometimes to participate in multiple auctions. Dependences between components of the composite product (including substitute items) are represented in the Simple Hierarchical Order Planner (SHOP) domain. The bidding strategy of the agent is adaptive according to market conditions and the future auction price is estimated with a linear Kalman filter.

متن کامل

Adaptation of Hierarchical Task Network Plans

This paper presents RepairSHOP a system capable of performing plan adaptation and plan repair. RepairSHOP is built on top of the HTN planner SHOP. RepairSHOP has three properties. The first property is its design modularity, which makes it is straightforward to apply the same process discussed in this paper to build plan adaptation capabilities in other HTN planners. Second, RepairSHOP can perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999